package com.imooc.distributedemo.resume.leetcode;

import java.util.HashMap;
import java.util.Map;

/**
 * leetcode13 罗马数字转数值
 */
public class Solution13 {

    static Map<Character, Integer> symbolValues = new HashMap<Character, Integer>() {{
        put('I', 1);
        put('V', 5);
        put('X', 10);
        put('L', 50);
        put('C', 100);
        put('D', 500);
        put('M', 1000);
    }};


    public static void main(String[] args) {
        String roman = "MCMXCIV";
        int number = romanToInt(roman);
        System.out.println(number);
    }

    public static int romanToInt(String s) {

        int ans = 0;
        int n = s.length();
        for (int i = 0; i < n; i++) {
            int value = symbolValues.get(s.charAt(i));
            if(i<n-1&&value<symbolValues.get(s.charAt(i+1))){
                ans -= value;
            }else{
                ans += value;
            }
        }

        return ans;
    }

}
